On a Ramsey-type problem of Erdős and Pach
نویسندگان
چکیده
In this paper we show that there exists a constant C > 0 such that for any graph G on Ck ln k vertices either G or its complement G has an induced subgraph on k vertices with minimum degree at least 2 (k− 1). This affirmatively answers a question of Erdős and Pach from 1983.
منابع مشابه
A Precise Threshold for Quasi-Ramsey Numbers
We consider a variation of Ramsey numbers introduced by Erdős and Pach [6], where instead of seeking complete or independent sets we only seek a t-homogeneous set, a vertex subset that induces a subgraph of minimum degree at least t or the complement of such a graph. For any ν > 0 and positive integer k, we show that any graph G or its complement contains as an induced subgraph some graph H on ...
متن کاملRamsey-type Theorems with Forbidden Subgraphs
A graph is called H-free if it contains no induced copy of H . We discuss the following question raised by Erdős and Hajnal. Is it true that for every graph H , there exists an ε(H) > 0 such that any H-free graph with n vertices contains either a complete or an empty subgraph of size at least n? We answer this question in the affirmative for a special class of graphs, and give an equivalent ref...
متن کاملRamsey Theory, Integer Partitions and a New Proof of the Erdős-Szekeres Theorem
Let H be a k-uniform hypergraph whose vertices are the integers 1, . . . , N . We say that H contains a monotone path of length n if there are x1 < x2 < · · · < xn+k−1 so that H contains all n edges of the form {xi, xi+1, . . . , xi+k−1}. Let Nk(q, n) be the smallest integer N so that every q-coloring of the edges of the complete k-uniform hypergraph on N vertices contains a monochromatic monot...
متن کاملRamsey-type results for semi-algebraic relations Citation
A k-ary semi-algebraic relation E on R is a subset of R, the set of k-tuples of points in R , which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a relation is at most t if the number of polynomials and their degrees are all bounded by t. A set A ⊂ R is called homogeneous if all or none of the k-tuples from A s...
متن کاملApplications of a New Separator Theorem for String Graphs
An intersection graph of curves in the plane is called a string graph. Matoušek almost completely settled a conjecture of the authors by showing that every string graph with m edges admits a vertex separator of size O( √ m logm). In the present note, this bound is combined with a result of the authors, according to which every dense string graph contains a large complete balanced bipartite grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015